The Complexity of Tree Transducer Output Languages
نویسندگان
چکیده
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class is NP-complete.
منابع مشابه
A Pumping Lemma for Output Languages of Macro Tree Transducers
The concept of macro tree transducer is a formal model for studying properties of syntax{ directed translations and of functional languages which are based on primitive recursion. In this paper, for output languages of producing and nondeleting macro tree transducers, we introduce and prove a pumping lemma. We apply this pumping lemma to gain two results: (1) there is no producing and nondeleti...
متن کاملOn the Generating Power of Deterministic Tree Transducers
Attributed tree transducers are abstract models to study properties of attribute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context{free grammar. In this paper we show that with respect to the generating power this is not an abstraction,...
متن کاملOutput String Languages of Compositions of Deterministic Macro Tree Transducers
The composition of total deterministic macro tree transducers gives rise to a proper hierarchy with respect to their output string languages (these are the languages obtained by taking the yields of the output trees). There is a language not in this hierarchy which can be generated by a (quite restricted) nondeterministic string transducer, namely, a two-way generalized sequential machine. Simi...
متن کاملA Pumping Lemma for Output Languages of Attributed Tree Transducers
The concept of attributed tree transducer is a formal model for studying properties of attribute grammars In this paper for output languages of noncircular producing and visiting attributed tree transducers we introduce and prove a pumping lemma We ap ply this pumping lemma to gain two results there is no noncircular producing and visiting attributed tree transducer which computes the set of al...
متن کاملComplexity and Expressiveness of Models of Xml Translations
XML has become widely used in computer industry, and the importance of static analysis and verification of applications manipulating XML documents is increasing. For analyzing or proving any properties on XML manipulating programs, it is essential to have some model with theoretically well-defined semantics. After a long history of researches on models of treeto-tree translations, a recent tren...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008